Filling polygonal holes with bicubic patches
نویسندگان
چکیده
Consider a bicubic rectangular patch complex which surrounds an n-sided hole in R. Then the problem of filling the hole with n bicubic rectangular patches is studied.
منابع مشابه
Minimal bi-6 G2 completion of bicubic spline surfaces
This paper addresses a gap in the arsenal of curvature continuous tensor-product spline constructions: an algorithm is provided to fill n-sided holes in C bi-3 spline surfaces using n patches of degree bi-6. Numerous experiments illustrate good highlight line and curvature distribution on the resulting surfaces.
متن کاملG2 Tensor Product Splines over Extraordinary Vertices
We present a second order smooth filling of an n-valent Catmull-Clark spline ring with n biseptic patches. While an underdetermined biseptic solution to this problem has appeared previously, we make several advances in this paper. Most notably, we cast the problem as a constrained minimization and introduce a novel quadratic energy functional whose absolute minimum of zero is achieved for bicub...
متن کاملConstructive modeling of G1 bifurcation
This paper deals with the modeling of G1 bifurcation. A branch-blending strategy is applied to model the bifurcation such that the coherence among the individual branching segments is characterized. To achieve this, bicubic Bézier patches are first used to generate three half-tubular surfaces by sweeping operations. The bifurcation modeling is then converted to a problem of filling two triangul...
متن کاملSmoothing Polyhedra Using Trimmned Bicubic Patches
Several efficient constructions of smooth surfaces following the outlines of a polyhedral mesh are based on three-sided patches. To demonstrate that these constructions arc compatible with existing software based on tensor-product patches, the particular scheme in [3] is expressed in terms of linearly-trimmed bicubic patches. Explicit formulas relating the coefficients of the patches to the ver...
متن کاملSmoothing Polyhedra Using Trimmed Bicubic Patches
Several efficient constructions of smooth surfaces following the outlines of a polyhedral mesh are based on three-sided patches. To demonstrate that these constructions arc compatible with existing software based on tensor-product patches, the particular scheme in [3] is expressed in terms of linearly-trimmed bicubic patches. Explicit formulas relating the coefficients of the patches to the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 11 شماره
صفحات -
تاریخ انتشار 1994